Improving a Flexible Manufacturing Scheduling using Genetic Algorithm

نویسندگان

  • Pankaj Upadhyay
  • S. C. Srivastava
چکیده

A Flexible Manufacturing System (FMS) is designed to produce a variety of products, utilizing a set of resources like work stations, robots etc., interlinked by certain means of transport. The prime characteristic of an FMS is that the overall system is under the computer control to realize these essential improvements in a firm; it imposes many challenging problems for planning, scheduling, monitoring and control of manufacturing system. These problems have a fundamental implication on the overall performance of a FMS, and influence the responsiveness of the system to satisfy the changing customer needs. In this study, dispatching rules are used to solve the scheduling problem. Further, the multiple dispatching rule based heuristic is proposed to search the optimal sequence of operations. Genetic Algorithm (GA) is used as a random search optimization technique in the proposed heuristic. Finally, the sequence determined with the proposed heuristic is utilized to develop based intelligent controller.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scheduling of flexible manufacturing systems using genetic algorithm: A heuristic approach

Scheduling of production in Flexible Manufacturing Systems (FMSs) has been extensively investigated over the past years and it continues to attract the interest of both academic researchers and practitioners. The generation of new and modified production schedules is becoming a necessity in today’s complex manufacturing environment. Genetic algorithms are used in this paper to obtain an initial...

متن کامل

A HYBRID GENETIC ALGORITHM FOR A BI-OBJECTIVE SCHEDULING PROBLEM IN A FLEXIBLE MANUFACTURING CELL

 This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...

متن کامل

Role of batch size in scheduling optimization of flexible manufacturing system using genetic algorithm

Flexible manufacturing system (FMS) readily addresses the dynamic needs of the customers in terms of variety and quality. At present, there is a need to produce a wide range of quality products in limited time span. On-time delivery of customers’ orders is critical in make-to-order (MTO) manufacturing systems. The completion time of the orders depends on several factors including arrival rate, ...

متن کامل

Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...

متن کامل

MULTI-OBJECTIVE ROUTING AND SCHEDULING IN FLEXIBLE MANUFACTURING SYSTEMS UNDER UNCERTAINTY

The efficiency of transportation system management plays an important role in the planning and operation efficiency of flexible manufacturing systems. Automated Guided Vehicles (AGV) are part of diversified and advanced techniques in the field of material transportation which have many applications today and act as an intermediary between operating and storage equipment and are routed and contr...

متن کامل

Real-time Scheduling of a Flexible Manufacturing System using a Two-phase Machine Learning Algorithm

The static and analytic scheduling approach is very difficult to follow and is not always applicable in real-time. Most of the scheduling algorithms are designed to be established in offline environment. However, we are challenged with three characteristics in real cases: First, problem data of jobs are not known in advance. Second, most of the shop’s parameters tend to be stochastic. Third, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013